On Dynamical Cournot Game on a Graph

نویسندگان

  • E. Ahmed
  • M. I. Shehata
  • H. A. A. El-Saka
چکیده

Cournot dynamical game is studied on a graph. The stability of the system is studied. Prisoner's dilemma game is used to model natural gas transmission.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Cournot dynamic multi-team game using incomplete information dynamical system

In this paper, we study an incomplete information dynamical system. Then, we suggest a modification of this system and we applied it to the standard Cournot game. The equilibrium solutions and the conditions of their locally asymptotic stability for the static and the dynamic in monopoly and duopoly cases are studied. Also, we formulate and study the multi-team dynamic Cournot game. (C) 2012 El...

متن کامل

On the stability of quadratic dynamics in discrete time n-player Cournot games

Motivated by analyzing the dynamic adjustment process of players in an n-player Cournot game, in this paper a discrete-time quadratic dynamical system is proposed and the stability of its equilibrium is analyzed. Several output adjustment mechanisms (e.g. best reply, adaptive adjustment and myopic) and expectations (e.g. naïve and adaptive) in a Cournot game with linear price function and quadr...

متن کامل

ENTROPY OF DYNAMICAL SYSTEMS ON WEIGHTS OF A GRAPH

Let $G$ be a finite simple graph whose vertices and edges are weighted by two functions. In this paper we shall define and calculate entropy of a dynamical system on weights of the graph $G$, by using the weights of vertices and edges of $G$. We examine the conditions under which entropy of the dynamical system is zero, possitive or $+infty$. At the end it is shown that, for $rin [0,+infty]$, t...

متن کامل

On the Computational Complexity of the Domination Game

The domination game is played on an arbitrary graph $G$ by two players, Dominator and Staller. It is known that verifying whether the game domination number of a graph is bounded by a given integer $k$ is PSPACE-complete. On the other hand, it is showed in this paper that the problem can be solved for a graph $G$ in $mathcal O(Delta(G)cdot |V(G)|^k)$ time. In the special case when $k=3$ and the...

متن کامل

Complex Dynamics of a Cournot Investment Game with Delayed Bounded Rationality

In this work, we investigate a time delay structure for the dynamic system of Cournot investment game played by two heterogeneous players. One player adjusts its investment decision by the locally marginal profit while the other player makes its strategy via its marginal profit with time delay. The existence and stability of equilibrium solutions is discussed. To show how the stability of this ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1208.4528  شماره 

صفحات  -

تاریخ انتشار 2012